Fast Polar Decomposition of an Arbitrary Matrix

نویسندگان

  • Nicholas J. Higham
  • Robert S. Schreiber
چکیده

The polar decomposition of an m x n matrix A of full rank, where rn n, can be computed using a quadratically convergent algorithm of Higham SIAMJ. Sci. Statist. Comput., 7 (1986), pp. 1160-1174]. The algorithm is based on a Newton iteration involving a matrix inverse. It is shown how, with the use of a preliminary complete orthogonal decomposition, the algorithm can be extended to arbitrary A. The use of the algorithm to compute the positive semidefinite square root of a Hermitian positive semidefinite matrix is also described. A hybrid algorithm that adaptively switches from the matrix inversion based iteration to a matrix multiplication based iteration due to Kovarik, and to Bj6rck and Bowie, is formulated. The decision when to switch is made using a condition estimator. This "matrix multiplication rich" algorithm is shown to be more efficient on machines for which matrix multiplication can be executed 1.5 times faster than matrix inversion. Key words, polar decomposition, complete orthogonal decomposition, matrix square root, matrix multiplication, Schulz iteration, condition estimator AMS(MOS) subject classification. 65F05 C.R. classification. G.1.3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding the polar decomposition of a matrix by an efficient iterative method

Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.

متن کامل

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

متن کامل

An Estimation of Channel Characteristics for SVD-MIMO Antenna Array

This paper presents an analysis of the channel capacity for 2×2 multiple input multiple output (MIMO) antenna systems. In this research, channel capacity is simultaneously analyzed by arbitrary transmitting (Tx) and receiving (Rx) antenna correlation matrix with correlated fading channel matrix. The channel capacity for 2×2 MIMO system is calculated. Considered parameters include receiving sign...

متن کامل

A Fast Method for Synthesis Magnesium Hydroxide Nanoparticles, Thermal Stable and Flame Retardant Poly vinyl alcohol Nanocomposite

Magnesium hydroxide nanostructures as an effective flame retardant were synthesized by a facile and rapid microwave reaction. The effect of different surfactants such as cationic, anionic and polymeric on the morphology of magnesium hydroxide nanostructures was investigated. Nanostructures were characterized by X-ray diffraction (XRD), scanning electron microscopy (SEM) and Fourier transform in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 11  شماره 

صفحات  -

تاریخ انتشار 1990